.TH std::unordered_set::count 3 "2024.06.10" "http://cppreference.com" "C++ Standard Libary"
.SH NAME
std::unordered_set::count \- std::unordered_set::count

.SH Synopsis
   size_type count( const Key& key ) const; \fB(1)\fP \fI(since C++11)\fP
   template< class K >                      \fB(2)\fP \fI(since C++20)\fP
   size_type count( const K& x ) const;

   1) Returns the number of elements with key that compares equal to the specified
   argument key, which is either 0 or 1 since this container does not allow duplicates.
   2) Returns the number of elements with key that compares equivalent to the specified
   argument x. This overload participates in overload resolution only if
   Hash::is_transparent and KeyEqual::is_transparent are valid and each denotes a type.
   This assumes that such Hash is callable with both K and Key type, and that the
   KeyEqual is transparent, which, together, allows calling this function without
   constructing an instance of Key.

.SH Parameters

   key - key value of the elements to count
   x   - a value of any type that can be transparently compared with a key

.SH Return value

   1) Number of elements with key key, that is either 1 or 0.
   2) Number of elements with key that compares equivalent to x.

.SH Complexity

   Constant on average, worst case linear in the size of the container.

.SH Notes

           Feature-test macro          Value    Std                Feature
                                                      Heterogeneous comparison lookup
   __cpp_lib_generic_unordered_lookup 201811L (C++20) in unordered associative
                                                      containers, overload \fB(2)\fP

.SH Example


// Run this code

 #include <algorithm>
 #include <iostream>
 #include <unordered_set>

 int main()
 {
     std::unordered_set set{2, 7, 1, 8, 2, 8, 1, 8, 2, 8};

     std::cout << "The set is: ";
     for (int e : set)
         std::cout << e << ' ';

     const auto [min, max] = std::ranges::minmax(set);

     std::cout << "\\nNumbers from " << min << " to " << max << " that are in the set: ";
     for (int i{min}; i <= max; ++i)
         if (set.count(i) == 1)
             std::cout << i << ' ';
     std::cout << '\\n';
 }

.SH Possible output:

 The set is: 8 1 7 2
 Numbers from 1 to 8 that are in the set: 1 2 7 8

.SH See also

   find        finds element with specific key
               \fI(public member function)\fP
   contains    checks if the container contains element with specific key
   (C++20)     \fI(public member function)\fP
   equal_range returns range of elements matching a specific key
               \fI(public member function)\fP
